Parallel constraint satisfaction in memory-based decisions.
نویسندگان
چکیده
Three studies sought to investigate decision strategies in memory-based decisions and to test the predictions of the parallel constraint satisfaction (PCS) model for decision making (Glöckner & Betsch, 2008). Time pressure was manipulated and the model was compared against simple heuristics (take the best and equal weight) and a weighted additive strategy. From PCS we predicted that fast intuitive decision making is based on compensatory information integration and that decision time increases and confidence decreases with increasing inconsistency in the decision task. In line with these predictions we observed a predominant usage of compensatory strategies under all time-pressure conditions and even with decision times as short as 1.7 s. For a substantial number of participants, choices and decision times were best explained by PCS, but there was also evidence for use of simple heuristics. The time-pressure manipulation did not significantly affect decision strategies. Overall, the results highlight intuitive, automatic processes in decision making and support the idea that human information-processing capabilities are less severely bounded than often assumed.
منابع مشابه
Parallel Arc-Consistency for Functional Constraints
We present in this paper a parallel execution model of arc-consistency for Constraint Satisfaction Problems (CSP), implemented on a scaleable MIMD distributed memory machine. We have adopted the indexical scheme, an adequate approach to arc-consistency for functional constraints. The CSP is partitioned into N partitions, which are executed in parallel on N processors. Each processor applies seq...
متن کاملDomain Decomposition for Parallel Resolution of Constraint Satisfaction Problems with OpenMP
Many problems in computer science, especially in Artificial Intelligence, can be represented as constraint satisfaction problems (CSP). For example, scene labeling in computer vision involves testing possible interpretation of objects against relation rules. Other constraint satisfaction problems include theorem proving, scheduling, expert systems. These problems are typically NP-Complete becau...
متن کاملSolving Complex Legal Cases Using the Intuitive System
Aim Two major challenges in legal decision making arise from the usually high complexity of the cases and from the high level of uncertainty caused by incomplete or missing information. In most cases it is not possible to apply Bayesian probability calculus, and legal standards prohibit the application of fast-and-frugal heuristics. Based on a connectionist approach to decision making, Simon (2...
متن کاملStrategies for Distributed Constraint Satisfaction Problems
Constraint satisfaction problems are important in AI. Various distributed and parallel computing strategies have been proposed to solve these problems. In this paper, these strategies are classified as distributed-agent-based, parallel-agent-based, and function-agent-based distributed problem-solving strategies. These different strategies are presented and discussed. Parallel-agentbased strateg...
متن کاملDistributed, Interleaved, Parallel and Cooperative Search in Constraint Satisfaction Networks
In this work, we extend the efficiency of distributed search in constraint satisfaction networks. Our method adds interleaving and parallelism into distributed backtrack search. Moreover, it has a filtering capacity that makes it open to cooperative work. Experimentations show that 1) the shape of phase transition with random problem can be characterized, 2) important speed-up can be achieved w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Experimental psychology
دوره 58 3 شماره
صفحات -
تاریخ انتشار 2011